Petri Net Synthesis for Conflict Free Resource Allocation in Discrete State Systems
نویسندگان
چکیده
The theory of Petri nets that was conceived to model the interactions between asynchronous concurrent processes, can be extended to explore conflicts and delineate the options available to resolve such conflicts in such processes. To this end we define the property of essentially decision free places (EDF places) in Petri nets to represent the absence of conflicts in resource allocations. Using the theory of net invariants we develop a procedure for identifying non-EDF places in the synthesized logic. Furthermore, we outline a technique of resolving such contlicts with the use of ’NOT’ arcs in the Petri net. Some results in the synthesis of Petri net models of discrete state systems are provided as a prelude to the theory of EDF-ness. Acknowledgements The completion of this dissertation would not be possible but for the hearty indulgence of many individuals. Special recognition must go to my advisor Prof. Bruce H. Krogh, who suggested this topic, provided able guidance, encouragement, and valuable suggestions throughout the course of this work; his insightful attention to detail was an important influence in this dissertation. I also wish to thank the rest of my thesis committee composed of Prof. Ram Akella, and Prof. Jose Moura. With a deep sense of gratitude I wish to express my thanks to my parents, Prof. and Mrs. Ramji Rao, for their constant affection, encouragement and interest in my academic career. To them I dedicate this dissertation. My thanks are due to my many teachers, without whose benediction I would not be what I am today. I also wish to thank the indian student community at the Carnegie-Mellon University, for putting me up for the first few weeks of my arrival at Pittsburgh. Particularly, I would like to thank Shyam and Raj for mitigating my painful transition from FORTRAN to C. My fellow students deserve my appreciation, particularly Pete, Dai, Chris, Jay, and the rest of the Porter Hall flock for the many hours of interesting intellectual company.
منابع مشابه
Synthesis of Active Controller for Resources Allocation Systems
In this paper, we present a controller synthesis method for resource allocation systems based on coloured Petri nets (CPN). The first contribution of this work is the use of High-level Petri nets as a basis model for the specification of the plant model as well as for the controller generation. Indeed, we present an automatic generation of a controller characterised by a CPN subnet (with a fixe...
متن کاملDiscrete Event Models in Batch Control1
An automata-based approach for the modeling of batch plants as well as products is presented. The different units of a plant are modeled as bounded Petri nets and products are represented by way of their recipes. With the focus on synchronization and booking issues, we propose general Petri net building-blocks for the construction of these recipes. Both, resource and recipe models support forma...
متن کاملNetwork Resource Management for Improving Users Quality of experience in Software Defined Network by Weighted Fuzzy Petri-NetMethod
The rapid rise in popularity of multimedia applications, such as VoIP, IPTV and Video Conferencing, intensifies the need to consider resource management for user satisfaction. Furthermore, improving Quality of Experience (QoE) in Software Defined Networks (SDNs) services is one of the important issues to be addressed by provisioning optimum resource management. In this paper, resource allocatio...
متن کاملTime Management Approach on a Discrete Event Manufacturing System Modeled by Petri Net
Discrete event system, Supervisory control, Petri Net, Constraint This paper presents a method to manage the time in a manufacturing system for obtaining an optimized model. The system in this paper is modeled by the timed Petri net and the optimization is performed based on the structural properties of Petri nets. In a system there are some states which are called forbidden states an...
متن کاملExtremal Throughputs in Free-Choice Nets
We give a method to compute the throughput in a timed live and bounded free-choice Petri net under a total allocation (i.e. a 0-1 routing). We also characterize and compute the conflict-solving policies that achieve the smallest throughput in the special case of a 1-bounded net. They do not correspond to total allocations, but still have a small period.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006